Breif Announcement: A Calculus of Policy-Based Routing Systems

The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by independently setting local policies on route filtering and selection. This independence leads to fragile networking and makes analysis of policy configurations very complex. To aid the systematic and efficient study of the policy configuration space, this paper presents a reduction calculus on policy-based routing systems. In the calculus, we provide two types of reduction rules that transform policy configurations by merging duplicate and complementary router configurations to simplify analysis. We show that the reductions are sound, dual of each other and are locally complete. The reductions are also computationally attractive, requiring only local configuration information and modification. These properties establish our reduction calculus as a sound, efficient, and complete theory for scaling up existing analysis techniques. Disciplines Computer Sciences Comments Wang, A., Talcott, C., Gurney, A., Loo, B., & Scedrov, A., Brief Announcement: A Calculus of Policy-Based Routing Systems, ACM Symposium on Principles of Distributed Computing, July 2012, doi: 10.1145/ 2332432.2332501 © 1994, 1995, 1998, 2002, 2009 by ACM, Inc. Permission to copy and distribute this document is hereby granted provided that this notice is retained on all copies, that copies are not altered, and that ACM is credited when the material is used to form other copyright policies. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/684 Brief Announcement: A Calculus of Policy-Based Routing Systems Anduo Wang∗ Carolyn Talcott† Alexander J. T. Gurney∗ Boon Thau Loo∗ Andre Scedrov∗ ∗University of Pennsylvania, Philadelphia, Pennsylvania, USA †SRI, Menlo Park, California, USA {anduo,agurney,boonloo}@cis.upenn.edu [email protected] [email protected]